An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems
نویسندگان
چکیده
Randomized linear system solvers have become popular as they the potential to reduce floating point complexity while still achieving desirable convergence rates. One particularly promising cla...
منابع مشابه
Iterative Solution of Linear Systems
Recent advances in the eld of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for non-Hermitian matrices .
متن کاملIterative Solution of Piecewise Linear Systems
Abstract. The correct formulation of numerical models for free-surface hydrodynamics often requires the solution of special linear systems whose coefficient matrix is a piecewise constant function of the solution itself. In so doing one may prevent the development of unrealistic negative water depths. The resulting piecewise linear systems are equivalent to particular linear complementarity pro...
متن کاملIterative Solution of Dense Linear Systems
Integral equation methods have been used with great success in electromagnetic scattering calculations and in other problems involving unbounded computational domains. Their application is in many cases limited by the storage requirements of dense matrices and also by the rapidly increasing computational time. However, the use of iterative solvers and special methods for computing the matrix-ve...
متن کاملIterative solution of fuzzy linear systems
Linear systems have important applications to many branches of science and engineering. In many applications, at least some of the parameters of the system are represented by fuzzy rather than crisp numbers. So it is immensely important to develop numerical procedures that would appropriately treat general fuzzy linear systems (will be denoted by FLS) and solve them. In this paper firstly a gen...
متن کاملScalable Iterative Solution of Sparse Linear Systems
The eeciency of a parallel implementation of the conjugate gradient method precon-ditioned by an incomplete Cholesky factorization can vary dramatically depending on the column ordering chosen. One method to minimize the number of major parallel steps is to choose an ordering based on a coloring of the symmetric graph representing the nonzero adjacency structure of the matrix. In this paper, we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2021
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/19m1259481